Strong coding

Strong Edge Features for Image Coding

A two-component model is proposed for perceptual image coding. For the rst component of the model, the watershed operator is used to detect strong edge features. Then, an eecient morphological interpolation algorithm reconstructs the smooth areas of the image from the extracted edge information, also known as sketch data. The residual component, containing ne textures, is separately coded by a ...

Strong converses in source coding relative to a fidelity criterion

Abstracf -Two strong converses are obtained for an abstract alphabet stationary ergodic source coded relative to an appropriate fidelity criterion. It is shown that given a distortion rate point ( D , R ) , which lies below the rate distortion curve, 1) block codes that operate at rate level R must encode sample source blocks at a rate exceeding D with probability tending to one as block length...

Strong Entropy Concentration , Coding , Game Theory and Randomnesspeter

Strong converse exponent for classical-quantum channel coding

Milán Mosonyi 2, 3, ∗ and Tomohiro Ogawa † Institute for Advanced Studies, Technische Universität München, Lichtenbergstraße 2a, 85748 Garching, Germany Zentrum Mathematik, M5, Technische Universität München, Boltzmannstraße 3, 85748 Garching, Germany Mathematical Institute, Budapest University of Technology and Economics, Egry József u 1., Budapest, 1111 Hungary. Graduate School of Information...

Strong converse to the quantum channel coding theorem

A lower bound on the probability of decoding error for a quantum communication channel is presented, from which the strong converse to the quantum channel coding theorem is immediately shown. The results and their derivations are mostly straightforward extensions of the classical counterparts which were established by Arimoto, except that more careful treatment is necessary here due to the nonc...